A Variable Preconditioning Using the Sor Method for Gcr-like Methods

نویسندگان

  • K. ABE
  • S. - L. ZHANG
چکیده

We propose a variant of variable preconditioning for Generalized Conjugate Residual (GCR)-like methods. The preconditioning is carried out by roughly solving Az = v by an iterative method to a certain degree of accuracy instead of computing Kz = v in a conventional preconditioned algorithm. In our proposal, the number of iterations required for computing Az = v is changed at each iteration by establishing a stopping criterion. This enables the use of a stationary iterative method when applying different preconditioners. The proposed procedure is incorporated into GCR, and the mathematical convergence is proved. In numerical experiments, we employ the Successive Over-Relaxation (SOR) method for computing Az = v, and we demonstrate that GCR with the variable preconditioning using SOR is faster and more robust than GCR with an incomplete LU preconditioning, and the FGMRES and GMRESR methods with the variable preconditioning using the Generalized Minimal Residual (GMRES) method. Moreover, we confirm that different preconditioners are applied at each iteration.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Gcr-simple Solver and the Simple-type Preconditioning for Incompressible Navier-stokes Equations

The discretization of incompressible Navier-Stokes equation leads to a large linear system with a nonsymmetric and indefinite coefficient matrix. Many methods are known to overcome these difficulties: Uzawa method, SIMPLE-type methods, penalty method, pressure correction method, etc. In this paper, Krylov accelerated versions of the SIMPLE(R) methods: GCR-SIMPLE(R) are investigated, where SIMPL...

متن کامل

Optimum parameter for the SOR-like method for augmented systems

Recently, several proposals for the generalization of Young’s SOR method to the saddle point problem or the augmented system has been presented. One of the most practical versions is the SOR-like method given by Golub et al., [(2001). SOR-like methods for augmented systems. BIT, 41, 71–85.], where the convergence and the determination of its optimum parameters were given. In this article, a ful...

متن کامل

Towards Polyalgorithmic Linear System Solvers for Nonlinear Elliptic Problems

We investigate the performance of several preconditioned Conjugate-Gradient-like algorithms and a standard stationary iterative method (block-line-SOR) on linear systems of equations as they arise from a nonlinear elliptic ame sheet problem simulation. The nonlinearity forces a pseudo-transient continuation process that makes the problem parabolic and thus compacts the spectrum of the Jacobian ...

متن کامل

A scalable Helmholtz solver in GRAPES over large-scale multicore cluster

This paper discusses performance optimization on the dynamical core of global numerical weather prediction model in Global/Regional Assimilation and Prediction System (GRAPES). GRAPES is a new generation of numerical weather prediction system developed and currently used by Chinese Meteorology Administration. The computational performance of the dynamical core in GRAPES relies on the efficient ...

متن کامل

A Parallel Implementation of the Block Preconditioned GCR Method

The parallel implementation of GCR is addressed, with particular focus on communication costs associated with orthogonalization processes. This consideration brings up questions concerning the use of Householder reflections with GCR. To precondition the GCR method a block Gauss-Jacobi method is used. Approximate solvers are used to obtain a solution of the diagonal blocks. Experiments on a clus...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005